K-nearest neighbors algorithm

Results: 173



#Item
11A Quadratic Regulator-Based Heuristic for Rapidly Exploring State Space Elena Glassman and Russ Tedrake Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of findin

A Quadratic Regulator-Based Heuristic for Rapidly Exploring State Space Elena Glassman and Russ Tedrake Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of findin

Add to Reading List

Source URL: eglassman.github.io

Language: English - Date: 2016-07-29 16:41:12
12Finding Subspace Clusters using Ranked Neighborhoods Emin Aksehirli • , Siegfried Nijssen ◦, ∗ , Matthijs van Leeuwen ◦, ∗ and Bart Goethals • •  ◦

Finding Subspace Clusters using Ranked Neighborhoods Emin Aksehirli • , Siegfried Nijssen ◦, ∗ , Matthijs van Leeuwen ◦, ∗ and Bart Goethals • • ◦

Add to Reading List

Source URL: www.patternsthatmatter.org

Language: English - Date: 2016-01-15 06:48:18
13Exemplar-Based Human Action Pose Correction and Tagging Wei Shen Ke Deng  Xiang Bai

Exemplar-Based Human Action Pose Correction and Tagging Wei Shen Ke Deng Xiang Bai

Add to Reading List

Source URL: pages.ucsd.edu

Language: English - Date: 2012-04-22 01:00:06
14Towards Open World Recognition Abhijit Bendale, Terrance Boult University of Colorado at Colorado Springs {abendale,tboult}@vast.uccs.edu  Abstract

Towards Open World Recognition Abhijit Bendale, Terrance Boult University of Colorado at Colorado Springs {abendale,tboult}@vast.uccs.edu Abstract

Add to Reading List

Source URL: www.cv-foundation.org

Language: English - Date: 2015-05-25 21:18:31
15Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
16“Why Should I Trust You?” Explaining the Predictions of Any Classifier Marco Tulio Ribeiro Sameer Singh

“Why Should I Trust You?” Explaining the Predictions of Any Classifier Marco Tulio Ribeiro Sameer Singh

Add to Reading List

Source URL: sameersingh.org

Language: English - Date: 2016-08-18 16:00:00
17EFFICIENT SETTLEMENT SELECTION FOR INTERACTIVE DISPLAY Marc van Kreveld* Rene van Oostrum* Department of Computer Science Utrecht University

EFFICIENT SETTLEMENT SELECTION FOR INTERACTIVE DISPLAY Marc van Kreveld* Rene van Oostrum* Department of Computer Science Utrecht University

Add to Reading List

Source URL: mapcontext.com

Language: English - Date: 2008-08-29 22:34:30
18Proc. of the 12th Int. Conference on Digital Audio Effects (DAFx-09), Como, Italy, September 1-4, 2009  INFORMED SELECTION OF FRAMES FOR MUSIC SIMILARITY COMPUTATION Klaus Seyerlehner, Tim Pohle  Gerhard Widmer, Dominik

Proc. of the 12th Int. Conference on Digital Audio Effects (DAFx-09), Como, Italy, September 1-4, 2009 INFORMED SELECTION OF FRAMES FOR MUSIC SIMILARITY COMPUTATION Klaus Seyerlehner, Tim Pohle Gerhard Widmer, Dominik

Add to Reading List

Source URL: www.cp.jku.at

Language: English - Date: 2009-10-07 06:10:34
19Least Squares Classification Stephen Boyd EE103 Stanford University  November 5, 2015

Least Squares Classification Stephen Boyd EE103 Stanford University November 5, 2015

Add to Reading List

Source URL: stanford.edu

Language: English - Date: 2015-11-05 13:10:49
20Mach Learn DOIs10994Visualizing non-metric similarities in multiple maps Laurens van der Maaten · Geoffrey Hinton

Mach Learn DOIs10994Visualizing non-metric similarities in multiple maps Laurens van der Maaten · Geoffrey Hinton

Add to Reading List

Source URL: lvdmaaten.github.io

Language: English - Date: 2016-07-16 15:30:43